________________________________________________________________

Run Header: Complete YList Version try 5: /small pw steps

Run start:        31.01.2010 12:16:17
Input Data from:  dataset167.txt
Iteration limit:  500
NI iter. limit:   200

# of Customers  :300
# of Locations  :20
Ex.Facilities   :3
Total budget    :25000
Terror. attacks :1

Penalty Weight : 0,5
Update Policy  : 4-3 of last 10
pw inc. step   : 0,005

Coverage Ratio :0,072
Average f[i]   :4525
Average g[i,j] :2027,45098039216
Total demand   :16560
________________________________________________________________

## ITERATION 0 #######################


> Neighbours evaluated; 53
> Selected Move:	3100	3	2	18	2500


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  4  0    >new incumb.: 3100


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 1 #######################


> Neighbours evaluated; 45
> Selected Move:	4440	1	-1	12	7500


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  4  0    >new incumb.: 4440


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 2 #######################


> Neighbours evaluated; 38
> Selected Move:	5640	1	-1	8	11500


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  1  0  0  0  1  0  0  0  0  0  4  0    >new incumb.: 5640


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 3 #######################


> Neighbours evaluated; 41
> Selected Move:	6730	1	-1	7	17500


> New Y[]: 
	
	 2  3  0  0  0  0  0  1  1  0  0  0  1  0  0  0  0  0  4  0    >new incumb.: 6730


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 4 #######################


> Neighbours evaluated; 39
> Selected Move:	7620	1	-1	4	23500


> New Y[]: 
	
	 2  3  0  0  1  0  0  1  1  0  0  0  1  0  0  0  0  0  4  0    >new incumb.: 7620


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 5 #######################


> Neighbours evaluated; 25
> Selected Move:	7620	4	18	4	22200


> New Y[]: 
	
	 2  3  0  0  4  0  0  1  1  0  0  0  1  0  0  0  0  0  1  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 6 #######################


> Neighbours evaluated; 16
> Selected Move:	7690	3	0	14	24300


> New Y[]: 
	
	 0  3  0  0  4  0  0  1  1  0  0  0  1  0  2  0  0  0  1  0    >new incumb.: 7690


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,495

## ITERATION 7 #######################


> Neighbours evaluated; 15
> Selected Move:	7690	4	4	7	23900


> New Y[]: 
	
	 0  3  0  0  1  0  0  4  1  0  0  0  1  0  2  0  0  0  1  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,49

## ITERATION 8 #######################


> Neighbours evaluated; 17
> Selected Move:	7690	4	7	12	24600


> New Y[]: 
	
	 0  3  0  0  1  0  0  1  1  0  0  0  4  0  2  0  0  0  1  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,485

## ITERATION 9 #######################


> Neighbours evaluated; 14
> Selected Move:	7690	4	12	14	24300


> New Y[]: 
	
	 0  3  0  0  1  0  0  1  1  0  0  0  2  0  4  0  0  0  1  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,48

## ITERATION 10 #######################


> Neighbours evaluated; 13
> Selected Move:	7690	4	12	4	23800


> New Y[]: 
	
	 0  3  0  0  2  0  0  1  1  0  0  0  1  0  4  0  0  0  1  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,475

## ITERATION 11 #######################


> Neighbours evaluated; 14
> Selected Move:	7690	4	4	7	23400


> New Y[]: 
	
	 0  3  0  0  1  0  0  2  1  0  0  0  1  0  4  0  0  0  1  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,47

## ITERATION 12 #######################


> Neighbours evaluated; 16
> Selected Move:	7690	4	14	4	24300


> New Y[]: 
	
	 0  3  0  0  4  0  0  2  1  0  0  0  1  0  1  0  0  0  1  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,465

## ITERATION 13 #######################


> Neighbours evaluated; 13
> Selected Move:	7690	4	4	7	24300


> New Y[]: 
	
	 0  3  0  0  2  0  0  4  1  0  0  0  1  0  1  0  0  0  1  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,46

## ITERATION 14 #######################


> Neighbours evaluated; 13
> Selected Move:	7690	4	4	12	24800


> New Y[]: 
	
	 0  3  0  0  1  0  0  4  1  0  0  0  2  0  1  0  0  0  1  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,455

## ITERATION 15 #######################


> Neighbours evaluated; 9
> Selected Move:	7690	4	7	12	24600


> New Y[]: 
	
	 0  3  0  0  1  0  0  2  1  0  0  0  4  0  1  0  0  0  1  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,45

## ITERATION 16 #######################


> Neighbours evaluated; 10
> Selected Move:	7690	4	7	4	25000


> New Y[]: 
	
	 0  3  0  0  2  0  0  1  1  0  0  0  4  0  1  0  0  0  1  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,445

## ITERATION 17 #######################


> Neighbours evaluated; 11
> Selected Move:	7650	3	7	11	24500


> New Y[]: 
	
	 0  3  0  0  2  0  0  0  1  0  0  1  4  0  1  0  0  0  1  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,44

## ITERATION 18 #######################


> Neighbours evaluated; 16
> Selected Move:	7650	4	4	11	24600


> New Y[]: 
	
	 0  3  0  0  1  0  0  0  1  0  0  2  4  0  1  0  0  0  1  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,435

## ITERATION 19 #######################


> Neighbours evaluated; 14
> Selected Move:	7650	4	11	14	24100


> New Y[]: 
	
	 0  3  0  0  1  0  0  0  1  0  0  1  4  0  2  0  0  0  1  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,43

## ITERATION 20 #######################


> Neighbours evaluated; 15
> Selected Move:	7650	4	12	4	23800


> New Y[]: 
	
	 0  3  0  0  4  0  0  0  1  0  0  1  1  0  2  0  0  0  1  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,425

## ITERATION 21 #######################


> Neighbours evaluated; 17
> Selected Move:	7650	4	4	11	24200


> New Y[]: 
	
	 0  3  0  0  1  0  0  0  1  0  0  4  1  0  2  0  0  0  1  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,42

## ITERATION 22 #######################


> Neighbours evaluated; 15
> Selected Move:	7650	4	11	14	23400


> New Y[]: 
	
	 0  3  0  0  1  0  0  0  1  0  0  2  1  0  4  0  0  0  1  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,415

## ITERATION 23 #######################


> Neighbours evaluated; 16
> Selected Move:	7650	4	11	4	23300


> New Y[]: 
	
	 0  3  0  0  2  0  0  0  1  0  0  1  1  0  4  0  0  0  1  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,41

## ITERATION 24 #######################


> Neighbours evaluated; 15
> Selected Move:	7650	4	4	8	24800


> New Y[]: 
	
	 0  3  0  0  1  0  0  0  2  0  0  1  1  0  4  0  0  0  1  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,405

## ITERATION 25 #######################


> Neighbours evaluated; 9
> Selected Move:	7650	4	8	12	23800


> New Y[]: 
	
	 0  3  0  0  1  0  0  0  1  0  0  1  2  0  4  0  0  0  1  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,4

## ITERATION 26 #######################


> Neighbours evaluated; 13
> Selected Move:	7650	4	12	18	24800


> New Y[]: 
	
	 0  3  0  0  1  0  0  0  1  0  0  1  1  0  4  0  0  0  2  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,395

## ITERATION 27 #######################


> Neighbours evaluated; 14
> Selected Move:	7611	4	14	18	25100


> New Y[]: 
	
	 0  3  0  0  1  0  0  0  1  0  0  1  1  0  2  0  0  0  4  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,39

## ITERATION 28 #######################


> Neighbours evaluated; 16
> Selected Move:	7580	3	14	0	23000


> New Y[]: 
	
	 2  3  0  0  1  0  0  0  1  0  0  1  1  0  0  0  0  0  4  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,385

## ITERATION 29 #######################


> Neighbours evaluated; 24
> Selected Move:	7580	4	18	4	21700


> New Y[]: 
	
	 2  3  0  0  4  0  0  0  1  0  0  1  1  0  0  0  0  0  1  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,38

## ITERATION 30 #######################


> Neighbours evaluated; 27
> Selected Move:	7580	4	4	8	23800


> New Y[]: 
	
	 2  3  0  0  1  0  0  0  4  0  0  1  1  0  0  0  0  0  1  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,375

## ITERATION 31 #######################


> Neighbours evaluated; 22
> Selected Move:	7620	3	11	7	24300


> New Y[]: 
	
	 2  3  0  0  1  0  0  1  4  0  0  0  1  0  0  0  0  0  1  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,37

## ITERATION 32 #######################


> Neighbours evaluated; 19
> Selected Move:	7620	4	8	7	21800


> New Y[]: 
	
	 2  3  0  0  1  0  0  4  1  0  0  0  1  0  0  0  0  0  1  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,365

## ITERATION 33 #######################


> Neighbours evaluated; 25
> Selected Move:	7620	4	7	12	22500


> New Y[]: 
	
	 2  3  0  0  1  0  0  1  1  0  0  0  4  0  0  0  0  0  1  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,36

## ITERATION 34 #######################


> Neighbours evaluated; 31
> Selected Move:	7600	3	4	14	23000


> New Y[]: 
	
	 2  3  0  0  0  0  0  1  1  0  0  0  4  0  1  0  0  0  1  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,355

## ITERATION 35 #######################


> Neighbours evaluated; 26
> Selected Move:	7600	4	12	7	22300


> New Y[]: 
	
	 2  3  0  0  0  0  0  4  1  0  0  0  1  0  1  0  0  0  1  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,35

## ITERATION 36 #######################


> Neighbours evaluated; 26
> Selected Move:	7600	4	7	8	24800


> New Y[]: 
	
	 2  3  0  0  0  0  0  1  4  0  0  0  1  0  1  0  0  0  1  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,345

## ITERATION 37 #######################


> Neighbours evaluated; 17
> Selected Move:	7600	4	8	14	21800


> New Y[]: 
	
	 2  3  0  0  0  0  0  1  1  0  0  0  1  0  4  0  0  0  1  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,34

## ITERATION 38 #######################


> Neighbours evaluated; 26
> Selected Move:	7608	1	-1	5	26300


> New Y[]: 
	
	 2  3  0  0  0  1  0  1  1  0  0  0  1  0  4  0  0  0  1  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,335

## ITERATION 39 #######################


> Neighbours evaluated; 20
> Selected Move:	7742	3	7	11	25800


> New Y[]: 
	
	 2  3  0  0  0  1  0  0  1  0  0  1  1  0  4  0  0  0  1  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,33

## ITERATION 40 #######################


> Neighbours evaluated; 26
> Selected Move:	7671	3	5	19	27300


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  1  0  0  1  1  0  4  0  0  0  1  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,325

## ITERATION 41 #######################


> Neighbours evaluated; 49
> Selected Move:	7655	3	19	15	26800


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  1  0  0  1  1  0  4  1  0  0  1  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,32

## ITERATION 42 #######################


> Neighbours evaluated; 34
> Selected Move:	7614	3	15	9	25800


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  1  1  0  1  1  0  4  0  0  0  1  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,325

## ITERATION 43 #######################


> Neighbours evaluated; 29
> Selected Move:	7560	2	9	-1	21300


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  1  0  0  1  1  0  4  0  0  0  1  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,33

## ITERATION 44 #######################


> Neighbours evaluated; 25
> Selected Move:	7560	4	14	8	24300


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  4  0  0  1  1  0  1  0  0  0  1  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,335

## ITERATION 45 #######################


> Neighbours evaluated; 20
> Selected Move:	7560	4	8	11	22600


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  1  0  0  4  1  0  1  0  0  0  1  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,34

## ITERATION 46 #######################


> Neighbours evaluated; 17
> Selected Move:	7650	3	0	4	24600


> New Y[]: 
	
	 0  3  0  0  2  0  0  0  1  0  0  4  1  0  1  0  0  0  1  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,345

## ITERATION 47 #######################


> Neighbours evaluated; 12
> Selected Move:	7650	4	4	11	24300


> New Y[]: 
	
	 0  3  0  0  4  0  0  0  1  0  0  2  1  0  1  0  0  0  1  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,35

## ITERATION 48 #######################


> Neighbours evaluated; 13
> Selected Move:	7650	4	11	12	24700


> New Y[]: 
	
	 0  3  0  0  4  0  0  0  1  0  0  1  2  0  1  0  0  0  1  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,345

## ITERATION 49 #######################


> Neighbours evaluated; 11
> Selected Move:	7621	3	11	7	25200


> New Y[]: 
	
	 0  3  0  0  4  0  0  1  1  0  0  0  2  0  1  0  0  0  1  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,34

## ITERATION 50 #######################


> Neighbours evaluated; 20
> Selected Move:	7358	3	4	19	25300


> New Y[]: 
	
	 0  3  0  0  0  0  0  1  1  0  0  0  2  0  1  0  0  0  1  4 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,335

## ITERATION 51 #######################


> Neighbours evaluated; 21
> Selected Move:	7460	4	12	7	24400


> New Y[]: 
	
	 0  3  0  0  0  0  0  2  1  0  0  0  1  0  1  0  0  0  1  4 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,33

## ITERATION 52 #######################


> Neighbours evaluated; 29
> Selected Move:	7460	4	7	14	24400


> New Y[]: 
	
	 0  3  0  0  0  0  0  1  1  0  0  0  1  0  2  0  0  0  1  4 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,325

## ITERATION 53 #######################


> Neighbours evaluated; 24
> Selected Move:	7600	3	14	0	22300


> New Y[]: 
	
	 2  3  0  0  0  0  0  1  1  0  0  0  1  0  0  0  0  0  1  4 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,32

## ITERATION 54 #######################


> Neighbours evaluated; 67
> Selected Move:	7600	4	19	7	21800


> New Y[]: 
	
	 2  3  0  0  0  0  0  4  1  0  0  0  1  0  0  0  0  0  1  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,315

## ITERATION 55 #######################


> Neighbours evaluated; 67
> Selected Move:	7600	4	7	8	24300


> New Y[]: 
	
	 2  3  0  0  0  0  0  1  4  0  0  0  1  0  0  0  0  0  1  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,31

## ITERATION 56 #######################


> Neighbours evaluated; 51
> Selected Move:	7600	4	8	12	22500


> New Y[]: 
	
	 2  3  0  0  0  0  0  1  1  0  0  0  4  0  0  0  0  0  1  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,305

## ITERATION 57 #######################


> Neighbours evaluated; 65
> Selected Move:	7600	4	12	18	23500


> New Y[]: 
	
	 2  3  0  0  0  0  0  1  1  0  0  0  1  0  0  0  0  0  4  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,3

## ITERATION 58 #######################


> Neighbours evaluated; 66
> Selected Move:	7600	3	19	14	24000


> New Y[]: 
	
	 2  3  0  0  0  0  0  1  1  0  0  0  1  0  1  0  0  0  4  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,295

## ITERATION 59 #######################


> Neighbours evaluated; 23
> Selected Move:	7560	3	7	11	23500


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  1  0  0  1  1  0  1  0  0  0  4  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,29

## ITERATION 60 #######################


> Neighbours evaluated; 22
> Selected Move:	7560	4	18	12	22500


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  1  0  0  1  4  0  1  0  0  0  1  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,285

## ITERATION 61 #######################


> Neighbours evaluated; 32
> Selected Move:	7580	3	14	4	22000


> New Y[]: 
	
	 2  3  0  0  1  0  0  0  1  0  0  1  4  0  0  0  0  0  1  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,28

## ITERATION 62 #######################


> Neighbours evaluated; 24
> Selected Move:	7580	4	12	11	22100


> New Y[]: 
	
	 2  3  0  0  1  0  0  0  1  0  0  4  1  0  0  0  0  0  1  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,275

## ITERATION 63 #######################


> Neighbours evaluated; 31
> Selected Move:	7560	3	4	19	22100


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  1  0  0  4  1  0  0  0  0  0  1  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,27

## ITERATION 64 #######################


> Neighbours evaluated; 69
> Selected Move:	7560	4	11	8	23800


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  4  0  0  1  1  0  0  0  0  0  1  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,265

## ITERATION 65 #######################


> Neighbours evaluated; 62
> Selected Move:	7560	4	8	12	22000


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  1  0  0  1  4  0  0  0  0  0  1  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,26

## ITERATION 66 #######################


> Neighbours evaluated; 67
> Selected Move:	7560	4	12	18	23000


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  1  0  0  1  1  0  0  0  0  0  4  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,255

## ITERATION 67 #######################


> Neighbours evaluated; 64
> Selected Move:	7560	4	18	19	21800


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  1  0  0  1  1  0  0  0  0  0  1  4 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,25

## ITERATION 68 #######################


> Neighbours evaluated; 73
> Selected Move:	7605	1	-1	14	28300


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  1  0  0  1  1  0  1  0  0  0  1  4 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,245

## ITERATION 69 #######################


> Neighbours evaluated; 40
> Selected Move:	7614	3	14	4	27800


> New Y[]: 
	
	 2  3  0  0  1  0  0  0  1  0  0  1  1  0  0  0  0  0  1  4 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,24

## ITERATION 70 #######################


> Neighbours evaluated; 45
> Selected Move:	7652	4	19	4	27700


> New Y[]: 
	
	 2  3  0  0  4  0  0  0  1  0  0  1  1  0  0  0  0  0  1  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,235

## ITERATION 71 #######################


> Neighbours evaluated; 50
> Selected Move:	7743	3	19	15	27200


> New Y[]: 
	
	 2  3  0  0  4  0  0  0  1  0  0  1  1  0  0  1  0  0  1  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,23

## ITERATION 72 #######################


> Neighbours evaluated; 32
> Selected Move:	7724	3	15	5	26200


> New Y[]: 
	
	 2  3  0  0  4  1  0  0  1  0  0  1  1  0  0  0  0  0  1  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,235

## ITERATION 73 #######################


> Neighbours evaluated; 28
> Selected Move:	7648	4	4	12	26500


> New Y[]: 
	
	 2  3  0  0  1  1  0  0  1  0  0  1  4  0  0  0  0  0  1  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,24

## ITERATION 74 #######################


> Neighbours evaluated; 21
> Selected Move:	7660	3	5	15	27500


> New Y[]: 
	
	 2  3  0  0  1  0  0  0  1  0  0  1  4  0  0  1  0  0  1  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,245

## ITERATION 75 #######################


> Neighbours evaluated; 31
> Selected Move:	7623	4	12	11	27600


> New Y[]: 
	
	 2  3  0  0  1  0  0  0  1  0  0  4  1  0  0  1  0  0  1  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,25

## ITERATION 76 #######################


> Neighbours evaluated; 29
> Selected Move:	7725	3	11	7	27300


> New Y[]: 
	
	 2  3  0  0  1  0  0  4  1  0  0  0  1  0  0  1  0  0  1  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,255

## ITERATION 77 #######################


> Neighbours evaluated; 30
> Selected Move:	7709	3	15	5	26300


> New Y[]: 
	
	 2  3  0  0  1  1  0  4  1  0  0  0  1  0  0  0  0  0  1  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,26

## ITERATION 78 #######################


> Neighbours evaluated; 28
> Selected Move:	7612	3	5	19	27800


> New Y[]: 
	
	 2  3  0  0  1  0  0  4  1  0  0  0  1  0  0  0  0  0  1  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,265

## ITERATION 79 #######################


> Neighbours evaluated; 48
> Selected Move:	7596	3	4	14	28300


> New Y[]: 
	
	 2  3  0  0  0  0  0  4  1  0  0  0  1  0  1  0  0  0  1  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,27

## ITERATION 80 #######################


> Neighbours evaluated; 32
> Selected Move:	7714	4	7	14	27800


> New Y[]: 
	
	 2  3  0  0  0  0  0  1  1  0  0  0  1  0  4  0  0  0  1  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,275

## ITERATION 81 #######################


> Neighbours evaluated; 53
> Selected Move:	7648	3	19	15	27300


> New Y[]: 
	
	 2  3  0  0  0  0  0  1  1  0  0  0  1  0  4  1  0  0  1  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,28

## ITERATION 82 #######################


> Neighbours evaluated; 30
> Selected Move:	7546	3	15	9	26300


> New Y[]: 
	
	 2  3  0  0  0  0  0  1  1  1  0  0  1  0  4  0  0  0  1  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,285

## ITERATION 83 #######################


> Neighbours evaluated; 27
> Selected Move:	7446	3	14	4	26700


> New Y[]: 
	
	 2  3  0  0  4  0  0  1  1  1  0  0  1  0  0  0  0  0  1  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,29

## ITERATION 84 #######################


> Neighbours evaluated; 18
> Selected Move:	7553	4	4	7	26300


> New Y[]: 
	
	 2  3  0  0  1  0  0  4  1  1  0  0  1  0  0  0  0  0  1  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,295

## ITERATION 85 #######################


> Neighbours evaluated; 20
> Selected Move:	7527	3	4	19	26300


> New Y[]: 
	
	 2  3  0  0  0  0  0  4  1  1  0  0  1  0  0  0  0  0  1  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,3

## ITERATION 86 #######################


> Neighbours evaluated; 68
> Selected Move:	7480	3	19	5	24800


> New Y[]: 
	
	 2  3  0  0  0  1  0  4  1  1  0  0  1  0  0  0  0  0  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,305

## ITERATION 87 #######################


> Neighbours evaluated; 50
> Selected Move:	7506	3	9	15	25800


> New Y[]: 
	
	 2  3  0  0  0  1  0  4  1  0  0  0  1  0  0  1  0  0  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,31

## ITERATION 88 #######################


> Neighbours evaluated; 58
> Selected Move:	7492	3	15	14	26800


> New Y[]: 
	
	 2  3  0  0  0  1  0  4  1  0  0  0  1  0  1  0  0  0  1  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,315

## ITERATION 89 #######################


> Neighbours evaluated; 27
> Selected Move:	7426	3	14	6	25300


> New Y[]: 
	
	 2  3  0  0  0  1  1  4  1  0  0  0  1  0  0  0  0  0  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,32

## ITERATION 90 #######################


> Neighbours evaluated; 69
> Selected Move:	7384	3	5	4	26800


> New Y[]: 
	
	 2  3  0  0  1  0  1  4  1  0  0  0  1  0  0  0  0  0  1  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,325

## ITERATION 91 #######################


> Neighbours evaluated; 38
> Selected Move:	7355	3	4	19	26800


> New Y[]: 
	
	 2  3  0  0  0  0  1  4  1  0  0  0  1  0  0  0  0  0  1  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,33

## ITERATION 92 #######################


> Neighbours evaluated; 67
> Selected Move:	7361	3	6	5	26300


> New Y[]: 
	
	 2  3  0  0  0  1  0  4  1  0  0  0  1  0  0  0  0  0  1  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,335

## ITERATION 93 #######################


> Neighbours evaluated; 78
> Selected Move:	7280	3	19	3	25300


> New Y[]: 
	
	 2  3  0  1  0  1  0  4  1  0  0  0  1  0  0  0  0  0  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,34

## ITERATION 94 #######################


> Neighbours evaluated; 46
> Selected Move:	7188	3	5	19	26800


> New Y[]: 
	
	 2  3  0  1  0  0  0  4  1  0  0  0  1  0  0  0  0  0  1  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,345

## ITERATION 95 #######################


> Neighbours evaluated; 48
> Selected Move:	7420	4	1	3	23900


> New Y[]: 
	
	 2  0  0  3  0  0  0  4  1  0  0  0  1  0  0  0  0  0  1  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,35

## ITERATION 96 #######################


> Neighbours evaluated; 59
> Selected Move:	7470	3	19	14	24400


> New Y[]: 
	
	 2  0  0  3  0  0  0  4  1  0  0  0  1  0  1  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0 
 > pw :0,355

## ITERATION 97 #######################


> Neighbours evaluated; 10
> Selected Move:	7470	4	3	7	24500


> New Y[]: 
	
	 2  0  0  4  0  0  0  3  1  0  0  0  1  0  1  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0 
 > pw :0,36

## ITERATION 98 #######################


> Neighbours evaluated; 13
> Selected Move:	7490	3	3	2	23000


> New Y[]: 
	
	 2  0  4  0  0  0  0  3  1  0  0  0  1  0  1  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0 
 > pw :0,365

## ITERATION 99 #######################


> Neighbours evaluated; 12
> Selected Move:	7580	3	0	4	25000


> New Y[]: 
	
	 0  0  4  0  2  0  0  3  1  0  0  0  1  0  1  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0 
 > pw :0,37

## ITERATION 100 #######################


> Neighbours evaluated; 6
> Selected Move:	7580	4	4	7	24300


> New Y[]: 
	
	 0  0  4  0  3  0  0  2  1  0  0  0  1  0  1  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0 
 > pw :0,365

## ITERATION 101 #######################


> Neighbours evaluated; 8
> Selected Move:	7580	4	4	12	24700


> New Y[]: 
	
	 0  0  4  0  1  0  0  2  1  0  0  0  3  0  1  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0 
 > pw :0,36

## ITERATION 102 #######################


> Neighbours evaluated; 8
> Selected Move:	7580	4	7	14	24700


> New Y[]: 
	
	 0  0  4  0  1  0  0  1  1  0  0  0  3  0  2  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0 
 > pw :0,355

## ITERATION 103 #######################


> Neighbours evaluated; 7
> Selected Move:	7580	4	12	4	24300


> New Y[]: 
	
	 0  0  4  0  3  0  0  1  1  0  0  0  1  0  2  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0 
 > pw :0,35

## ITERATION 104 #######################


> Neighbours evaluated; 7
> Selected Move:	7580	4	4	7	24600


> New Y[]: 
	
	 0  0  4  0  1  0  0  3  1  0  0  0  1  0  2  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0 
 > pw :0,345

## ITERATION 105 #######################


> Neighbours evaluated; 7
> Selected Move:	7580	4	7	14	24000


> New Y[]: 
	
	 0  0  4  0  1  0  0  2  1  0  0  0  1  0  3  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0 
 > pw :0,34

## ITERATION 106 #######################


> Neighbours evaluated; 7
> Selected Move:	7580	4	7	4	24400


> New Y[]: 
	
	 0  0  4  0  2  0  0  1  1  0  0  0  1  0  3  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0 
 > pw :0,335

## ITERATION 107 #######################


> Neighbours evaluated; 7
> Selected Move:	7580	4	4	12	24900


> New Y[]: 
	
	 0  0  4  0  1  0  0  1  1  0  0  0  2  0  3  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0 
 > pw :0,33

## ITERATION 108 #######################


> Neighbours evaluated; 9
> Selected Move:	7540	3	7	11	24400


> New Y[]: 
	
	 0  0  4  0  1  0  0  0  1  0  0  1  2  0  3  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0 
 > pw :0,325

## ITERATION 109 #######################


> Neighbours evaluated; 7
> Selected Move:	7540	4	12	4	23900


> New Y[]: 
	
	 0  0  4  0  2  0  0  0  1  0  0  1  1  0  3  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0 
 > pw :0,32

## ITERATION 110 #######################


> Neighbours evaluated; 8
> Selected Move:	7540	4	4	11	24000


> New Y[]: 
	
	 0  0  4  0  1  0  0  0  1  0  0  2  1  0  3  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0 
 > pw :0,315

## ITERATION 111 #######################


> Neighbours evaluated; 8
> Selected Move:	7540	4	11	14	23900


> New Y[]: 
	
	 0  0  4  0  1  0  0  0  1  0  0  3  1  0  2  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0 
 > pw :0,31

## ITERATION 112 #######################


> Neighbours evaluated; 7
> Selected Move:	7540	4	11	4	23800


> New Y[]: 
	
	 0  0  4  0  3  0  0  0  1  0  0  1  1  0  2  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0 
 > pw :0,305

## ITERATION 113 #######################


> Neighbours evaluated; 9
> Selected Move:	7540	4	4	12	24200


> New Y[]: 
	
	 0  0  4  0  1  0  0  0  1  0  0  1  3  0  2  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0 
 > pw :0,3

## ITERATION 114 #######################


> Neighbours evaluated; 8
> Selected Move:	7540	4	12	18	25000


> New Y[]: 
	
	 0  0  4  0  1  0  0  0  1  0  0  1  1  0  2  0  0  0  3  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0 
 > pw :0,295

## ITERATION 115 #######################


> Neighbours evaluated; 12
> Selected Move:	7470	3	14	0	22900


> New Y[]: 
	
	 2  0  4  0  1  0  0  0  1  0  0  1  1  0  0  0  0  0  3  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0 
 > pw :0,29

## ITERATION 116 #######################


> Neighbours evaluated; 14
> Selected Move:	7510	3	11	7	23400


> New Y[]: 
	
	 2  0  4  0  1  0  0  1  1  0  0  0  1  0  0  0  0  0  3  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0 
 > pw :0,285

## ITERATION 117 #######################


> Neighbours evaluated; 12
> Selected Move:	7510	4	18	4	22200


> New Y[]: 
	
	 2  0  4  0  3  0  0  1  1  0  0  0  1  0  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0 
 > pw :0,28

## ITERATION 118 #######################


> Neighbours evaluated; 15
> Selected Move:	7544	1	-1	15	27700


> New Y[]: 
	
	 2  0  4  0  3  0  0  1  1  0  0  0  1  0  0  1  0  0  1  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,275

## ITERATION 119 #######################


> Neighbours evaluated; 21
> Selected Move:	7655	3	7	11	27200


> New Y[]: 
	
	 2  0  4  0  3  0  0  0  1  0  0  1  1  0  0  1  0  0  1  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,27

## ITERATION 120 #######################


> Neighbours evaluated; 22
> Selected Move:	7639	4	4	11	27300


> New Y[]: 
	
	 2  0  4  0  1  0  0  0  1  0  0  3  1  0  0  1  0  0  1  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,265

## ITERATION 121 #######################


> Neighbours evaluated; 21
> Selected Move:	7624	4	11	15	27400


> New Y[]: 
	
	 2  0  4  0  1  0  0  0  1  0  0  1  1  0  0  3  0  0  1  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,26

## ITERATION 122 #######################


> Neighbours evaluated; 21
> Selected Move:	7650	3	15	19	27500


> New Y[]: 
	
	 2  0  4  0  1  0  0  0  1  0  0  1  1  0  0  0  0  0  1  3 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,265

## ITERATION 123 #######################


> Neighbours evaluated; 43
> Selected Move:	7635	3	4	14	28000


> New Y[]: 
	
	 2  0  4  0  0  0  0  0  1  0  0  1  1  0  1  0  0  0  1  3 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,27

## ITERATION 124 #######################


> Neighbours evaluated; 34
> Selected Move:	7647	4	19	14	27900


> New Y[]: 
	
	 2  0  4  0  0  0  0  0  1  0  0  1  1  0  3  0  0  0  1  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,275

## ITERATION 125 #######################


> Neighbours evaluated; 41
> Selected Move:	7580	3	19	15	27400


> New Y[]: 
	
	 2  0  4  0  0  0  0  0  1  0  0  1  1  0  3  1  0  0  1  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,28

## ITERATION 126 #######################


> Neighbours evaluated; 25
> Selected Move:	7508	3	15	5	26400


> New Y[]: 
	
	 2  0  4  0  0  1  0  0  1  0  0  1  1  0  3  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0 
 > pw :0,285

## ITERATION 127 #######################


> Neighbours evaluated; 15
> Selected Move:	7548	3	14	4	26200


> New Y[]: 
	
	 2  0  4  0  3  1  0  0  1  0  0  1  1  0  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0 
 > pw :0,29

## ITERATION 128 #######################


> Neighbours evaluated; 14
> Selected Move:	7517	3	5	19	27700


> New Y[]: 
	
	 2  0  4  0  3  0  0  0  1  0  0  1  1  0  0  0  0  0  1  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,295

## ITERATION 129 #######################


> Neighbours evaluated; 41
> Selected Move:	7474	4	4	11	27800


> New Y[]: 
	
	 2  0  4  0  1  0  0  0  1  0  0  3  1  0  0  0  0  0  1  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,3

## ITERATION 130 #######################


> Neighbours evaluated; 38
> Selected Move:	7500	3	19	5	26300


> New Y[]: 
	
	 2  0  4  0  1  1  0  0  1  0  0  3  1  0  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0 
 > pw :0,305

## ITERATION 131 #######################


> Neighbours evaluated; 16
> Selected Move:	7470	2	5	-1	21800


> New Y[]: 
	
	 2  0  4  0  1  0  0  0  1  0  0  3  1  0  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0 
 > pw :0,31

## ITERATION 132 #######################


> Neighbours evaluated; 14
> Selected Move:	7510	3	11	7	22500


> New Y[]: 
	
	 2  0  4  0  1  0  0  3  1  0  0  0  1  0  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0 
 > pw :0,315

## ITERATION 133 #######################


> Neighbours evaluated; 14
> Selected Move:	7510	4	7	8	24000


> New Y[]: 
	
	 2  0  4  0  1  0  0  1  3  0  0  0  1  0  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0 
 > pw :0,32

## ITERATION 134 #######################


> Neighbours evaluated; 11
> Selected Move:	7510	4	8	12	22600


> New Y[]: 
	
	 2  0  4  0  1  0  0  1  1  0  0  0  3  0  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0 
 > pw :0,325

## ITERATION 135 #######################


> Neighbours evaluated; 25
> Selected Move:	7490	3	4	14	23100


> New Y[]: 
	
	 2  0  4  0  0  0  0  1  1  0  0  0  3  0  1  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0 
 > pw :0,33

## ITERATION 136 #######################


> Neighbours evaluated; 13
> Selected Move:	7547	3	0	4	25100


> New Y[]: 
	
	 0  0  4  0  2  0  0  1  1  0  0  0  3  0  1  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0 
 > pw :0,335

## ITERATION 137 #######################


> Neighbours evaluated; 9
> Selected Move:	7540	3	7	11	24600


> New Y[]: 
	
	 0  0  4  0  2  0  0  0  1  0  0  1  3  0  1  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0 
 > pw :0,33

## ITERATION 138 #######################


> Neighbours evaluated; 8
> Selected Move:	7540	4	4	11	24700


> New Y[]: 
	
	 0  0  4  0  1  0  0  0  1  0  0  2  3  0  1  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0 
 > pw :0,325

## ITERATION 139 #######################


> Neighbours evaluated; 8
> Selected Move:	7540	4	11	12	24800


> New Y[]: 
	
	 0  0  4  0  1  0  0  0  1  0  0  3  2  0  1  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0 
 > pw :0,32

## ITERATION 140 #######################


> Neighbours evaluated; 6
> Selected Move:	7540	4	11	4	24700


> New Y[]: 
	
	 0  0  4  0  3  0  0  0  1  0  0  1  2  0  1  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0 
 > pw :0,315

## ITERATION 141 #######################


> Neighbours evaluated; 9
> Selected Move:	7540	4	12	11	24300


> New Y[]: 
	
	 0  0  4  0  3  0  0  0  1  0  0  2  1  0  1  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0 
 > pw :0,31

## ITERATION 142 #######################


> Neighbours evaluated; 8
> Selected Move:	7540	4	4	11	24300


> New Y[]: 
	
	 0  0  4  0  2  0  0  0  1  0  0  3  1  0  1  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0 
 > pw :0,305

## ITERATION 143 #######################


> Neighbours evaluated; 12
> Selected Move:	7450	3	4	0	22300


> New Y[]: 
	
	 2  0  4  0  0  0  0  0  1  0  0  3  1  0  1  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0 
 > pw :0,3

## ITERATION 144 #######################


> Neighbours evaluated; 18
> Selected Move:	7450	4	11	8	24000


> New Y[]: 
	
	 2  0  4  0  0  0  0  0  3  0  0  1  1  0  1  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0 
 > pw :0,295

## ITERATION 145 #######################


> Neighbours evaluated; 12
> Selected Move:	7490	3	11	7	24500


> New Y[]: 
	
	 2  0  4  0  0  0  0  1  3  0  0  0  1  0  1  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0 
 > pw :0,29

## ITERATION 146 #######################


> Neighbours evaluated; 11
> Selected Move:	7490	4	8	14	22400


> New Y[]: 
	
	 2  0  4  0  0  0  0  1  1  0  0  0  1  0  3  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0 
 > pw :0,285

## ITERATION 147 #######################


> Neighbours evaluated; 18
> Selected Move:	7501	1	-1	19	28400


> New Y[]: 
	
	 2  0  4  0  0  0  0  1  1  0  0  0  1  0  3  0  0  0  1  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,28

## ITERATION 148 #######################


> Neighbours evaluated; 39
> Selected Move:	7490	4	14	19	28500


> New Y[]: 
	
	 2  0  4  0  0  0  0  1  1  0  0  0  1  0  1  0  0  0  1  3 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,275

## ITERATION 149 #######################


> Neighbours evaluated; 36
> Selected Move:	7515	3	14	4	28000


> New Y[]: 
	
	 2  0  4  0  1  0  0  1  1  0  0  0  1  0  0  0  0  0  1  3 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,27

## ITERATION 150 #######################


> Neighbours evaluated; 42
> Selected Move:	7517	3	19	15	27900


> New Y[]: 
	
	 2  0  4  0  1  0  0  1  1  0  0  0  1  0  0  3  0  0  1  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,265

## ITERATION 151 #######################


> Neighbours evaluated; 21
> Selected Move:	7505	4	15	7	28000


> New Y[]: 
	
	 2  0  4  0  1  0  0  3  1  0  0  0  1  0  0  1  0  0  1  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,27

## ITERATION 152 #######################


> Neighbours evaluated; 21
> Selected Move:	7463	4	7	12	28100


> New Y[]: 
	
	 2  0  4  0  1  0  0  1  1  0  0  0  3  0  0  1  0  0  1  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,275

## ITERATION 153 #######################


> Neighbours evaluated; 22
> Selected Move:	7545	3	7	11	27600


> New Y[]: 
	
	 2  0  4  0  1  0  0  0  1  0  0  1  3  0  0  1  0  0  1  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,28

## ITERATION 154 #######################


> Neighbours evaluated; 28
> Selected Move:	7470	2	15	-1	22100


> New Y[]: 
	
	 2  0  4  0  1  0  0  0  1  0  0  1  3  0  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0 
 > pw :0,285

## ITERATION 155 #######################


> Neighbours evaluated; 14
> Selected Move:	7470	4	12	4	21700


> New Y[]: 
	
	 2  0  4  0  3  0  0  0  1  0  0  1  1  0  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0 
 > pw :0,29

## ITERATION 156 #######################


> Neighbours evaluated; 13
> Selected Move:	7470	4	4	8	23500


> New Y[]: 
	
	 2  0  4  0  1  0  0  0  3  0  0  1  1  0  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0 
 > pw :0,295

## ITERATION 157 #######################


> Neighbours evaluated; 21
> Selected Move:	7400	3	4	19	23500


> New Y[]: 
	
	 2  0  4  0  0  0  0  0  3  0  0  1  1  0  0  0  0  0  1  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,3

## ITERATION 158 #######################


> Neighbours evaluated; 65
> Selected Move:	7440	3	11	7	24000


> New Y[]: 
	
	 2  0  4  0  0  0  0  1  3  0  0  0  1  0  0  0  0  0  1  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,305

## ITERATION 159 #######################


> Neighbours evaluated; 59
> Selected Move:	7440	4	8	7	22500


> New Y[]: 
	
	 2  0  4  0  0  0  0  3  1  0  0  0  1  0  0  0  0  0  1  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,3

## ITERATION 160 #######################


> Neighbours evaluated; 71
> Selected Move:	7440	4	7	12	22600


> New Y[]: 
	
	 2  0  4  0  0  0  0  1  1  0  0  0  3  0  0  0  0  0  1  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,295

## ITERATION 161 #######################


> Neighbours evaluated; 69
> Selected Move:	7440	4	12	18	23400


> New Y[]: 
	
	 2  0  4  0  0  0  0  1  1  0  0  0  1  0  0  0  0  0  3  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,29

## ITERATION 162 #######################


> Neighbours evaluated; 64
> Selected Move:	7490	3	19	14	23900


> New Y[]: 
	
	 2  0  4  0  0  0  0  1  1  0  0  0  1  0  1  0  0  0  3  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0 
 > pw :0,285

## ITERATION 163 #######################


> Neighbours evaluated; 21
> Selected Move:	7450	3	7	11	23400


> New Y[]: 
	
	 2  0  4  0  0  0  0  0  1  0  0  1  1  0  1  0  0  0  3  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0 
 > pw :0,28

## ITERATION 164 #######################


> Neighbours evaluated; 15
> Selected Move:	7450	4	18	12	22600


> New Y[]: 
	
	 2  0  4  0  0  0  0  0  1  0  0  1  3  0  1  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0 
 > pw :0,275

## ITERATION 165 #######################


> Neighbours evaluated; 18
> Selected Move:	7450	4	12	14	21900


> New Y[]: 
	
	 2  0  4  0  0  0  0  0  1  0  0  1  1  0  3  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0 
 > pw :0,27

## ITERATION 166 #######################


> Neighbours evaluated; 24
> Selected Move:	7430	3	2	3	23400


> New Y[]: 
	
	 2  0  0  4  0  0  0  0  1  0  0  1  1  0  3  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0 
 > pw :0,265

## ITERATION 167 #######################


> Neighbours evaluated; 15
> Selected Move:	7470	3	11	7	23900


> New Y[]: 
	
	 2  0  0  4  0  0  0  1  1  0  0  0  1  0  3  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0 
 > pw :0,26

## ITERATION 168 #######################


> Neighbours evaluated; 15
> Selected Move:	7470	4	3	7	23200


> New Y[]: 
	
	 2  0  0  1  0  0  0  4  1  0  0  0  1  0  3  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0 
 > pw :0,255

## ITERATION 169 #######################


> Neighbours evaluated; 17
> Selected Move:	7470	4	7	12	23900


> New Y[]: 
	
	 2  0  0  1  0  0  0  1  1  0  0  0  4  0  3  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0 
 > pw :0,25

## ITERATION 170 #######################


> Neighbours evaluated; 16
> Selected Move:	7470	4	12	14	23400


> New Y[]: 
	
	 2  0  0  1  0  0  0  1  1  0  0  0  3  0  4  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0 
 > pw :0,245

## ITERATION 171 #######################


> Neighbours evaluated; 15
> Selected Move:	7470	4	12	3	23900


> New Y[]: 
	
	 2  0  0  3  0  0  0  1  1  0  0  0  1  0  4  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0 
 > pw :0,24

## ITERATION 172 #######################


> Neighbours evaluated; 15
> Selected Move:	7470	4	3	7	23300


> New Y[]: 
	
	 2  0  0  1  0  0  0  3  1  0  0  0  1  0  4  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0 
 > pw :0,235

## ITERATION 173 #######################


> Neighbours evaluated; 17
> Selected Move:	7470	4	7	8	24800


> New Y[]: 
	
	 2  0  0  1  0  0  0  1  3  0  0  0  1  0  4  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0 
 > pw :0,23

## ITERATION 174 #######################


> Neighbours evaluated; 13
> Selected Move:	7470	4	8	18	24200


> New Y[]: 
	
	 2  0  0  1  0  0  0  1  1  0  0  0  1  0  4  0  0  0  3  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0 
 > pw :0,225

## ITERATION 175 #######################


> Neighbours evaluated; 15
> Selected Move:	7470	4	14	7	24700


> New Y[]: 
	
	 2  0  0  1  0  0  0  4  1  0  0  0  1  0  1  0  0  0  3  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0 
 > pw :0,22

## ITERATION 176 #######################


> Neighbours evaluated; 13
> Selected Move:	7470	4	18	12	23900


> New Y[]: 
	
	 2  0  0  1  0  0  0  4  1  0  0  0  3  0  1  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0 
 > pw :0,215

## ITERATION 177 #######################


> Neighbours evaluated; 15
> Selected Move:	7470	4	7	3	24600


> New Y[]: 
	
	 2  0  0  4  0  0  0  1  1  0  0  0  3  0  1  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0 
 > pw :0,21

## ITERATION 178 #######################


> Neighbours evaluated; 16
> Selected Move:	7449	4	3	12	25100


> New Y[]: 
	
	 2  0  0  3  0  0  0  1  1  0  0  0  4  0  1  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0 
 > pw :0,205

## ITERATION 179 #######################


> Neighbours evaluated; 12
> Selected Move:	7470	4	3	7	24500


> New Y[]: 
	
	 2  0  0  1  0  0  0  3  1  0  0  0  4  0  1  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0 
 > pw :0,2

## ITERATION 180 #######################


> Neighbours evaluated; 19
> Selected Move:	7430	3	7	11	23800


> New Y[]: 
	
	 2  0  0  1  0  0  0  0  1  0  0  3  4  0  1  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0 
 > pw :0,195

## ITERATION 181 #######################


> Neighbours evaluated; 17
> Selected Move:	7484	1	-1	19	29800


> New Y[]: 
	
	 2  0  0  1  0  0  0  0  1  0  0  3  4  0  1  0  0  0  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,19

## ITERATION 182 #######################


> Neighbours evaluated; 29
> Selected Move:	7736	4	12	14	28600


> New Y[]: 
	
	 2  0  0  1  0  0  0  0  1  0  0  3  1  0  4  0  0  0  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,185

## ITERATION 183 #######################


> Neighbours evaluated; 33
> Selected Move:	7810	4	11	19	28300


> New Y[]: 
	
	 2  0  0  1  0  0  0  0  1  0  0  1  1  0  4  0  0  0  1  3 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,18

## ITERATION 184 #######################


> Neighbours evaluated; 39
> Selected Move:	7776	3	11	7	28800


> New Y[]: 
	
	 2  0  0  1  0  0  0  1  1  0  0  0  1  0  4  0  0  0  1  3 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,185

## ITERATION 185 #######################


> Neighbours evaluated; 44
> Selected Move:	7665	4	14	7	29300


> New Y[]: 
	
	 2  0  0  1  0  0  0  4  1  0  0  0  1  0  1  0  0  0  1  3 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,19

## ITERATION 186 #######################


> Neighbours evaluated; 34
> Selected Move:	7662	4	19	14	29200


> New Y[]: 
	
	 2  0  0  1  0  0  0  4  1  0  0  0  1  0  3  0  0  0  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,195

## ITERATION 187 #######################


> Neighbours evaluated; 35
> Selected Move:	7622	4	7	14	29300


> New Y[]: 
	
	 2  0  0  1  0  0  0  3  1  0  0  0  1  0  4  0  0  0  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,2

## ITERATION 188 #######################


> Neighbours evaluated; 36
> Selected Move:	7580	4	7	12	29400


> New Y[]: 
	
	 2  0  0  1  0  0  0  1  1  0  0  0  3  0  4  0  0  0  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,205

## ITERATION 189 #######################


> Neighbours evaluated; 34
> Selected Move:	7621	3	7	11	28900


> New Y[]: 
	
	 2  0  0  1  0  0  0  0  1  0  0  1  3  0  4  0  0  0  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,21

## ITERATION 190 #######################


> Neighbours evaluated; 41
> Selected Move:	7516	3	19	15	28400


> New Y[]: 
	
	 2  0  0  1  0  0  0  0  1  0  0  1  3  0  4  1  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,215

## ITERATION 191 #######################


> Neighbours evaluated; 14
> Selected Move:	7564	4	12	11	28100


> New Y[]: 
	
	 2  0  0  1  0  0  0  0  1  0  0  3  1  0  4  1  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,22

## ITERATION 192 #######################


> Neighbours evaluated; 19
> Selected Move:	7526	4	11	15	28200


> New Y[]: 
	
	 2  0  0  1  0  0  0  0  1  0  0  1  1  0  4  3  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,225

## ITERATION 193 #######################


> Neighbours evaluated; 22
> Selected Move:	7518	3	15	1	26300


> New Y[]: 
	
	 2  3  0  1  0  0  0  0  1  0  0  1  1  0  4  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0 
 > pw :0,23

## ITERATION 194 #######################


> Neighbours evaluated; 13
> Selected Move:	7601	3	3	6	26300


> New Y[]: 
	
	 2  3  0  0  0  0  1  0  1  0  0  1  1  0  4  0  0  0  1  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,235

## ITERATION 195 #######################


> Neighbours evaluated; 57
> Selected Move:	7521	3	14	4	26700


> New Y[]: 
	
	 2  3  0  0  4  0  1  0  1  0  0  1  1  0  0  0  0  0  1  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,24

## ITERATION 196 #######################


> Neighbours evaluated; 42
> Selected Move:	7602	3	6	9	26200


> New Y[]: 
	
	 2  3  0  0  4  0  0  0  1  1  0  1  1  0  0  0  0  0  1  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,245

## ITERATION 197 #######################


> Neighbours evaluated; 21
> Selected Move:	7552	3	4	19	26300


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  1  1  0  1  1  0  0  0  0  0  1  4 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,25

## ITERATION 198 #######################


> Neighbours evaluated; 69
> Selected Move:	7495	4	19	12	26500


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  1  1  0  1  4  0  0  0  0  0  1  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,255

## ITERATION 199 #######################


> Neighbours evaluated; 64
> Selected Move:	7538	3	9	14	28500


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  1  0  0  1  4  0  1  0  0  0  1  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,26

## ITERATION 200 #######################


> Neighbours evaluated; 40
> Selected Move:	7520	3	14	4	28000


> New Y[]: 
	
	 2  3  0  0  1  0  0  0  1  0  0  1  4  0  0  0  0  0  1  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,265

## ITERATION 201 #######################


> Neighbours evaluated; 43
> Selected Move:	7493	3	19	9	26500


> New Y[]: 
	
	 2  3  0  0  1  0  0  0  1  1  0  1  4  0  0  0  0  0  1  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,27

## ITERATION 202 #######################


> Neighbours evaluated; 19
> Selected Move:	7458	4	12	11	26600


> New Y[]: 
	
	 2  3  0  0  1  0  0  0  1  1  0  4  1  0  0  0  0  0  1  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,275

## ITERATION 203 #######################


> Neighbours evaluated; 19
> Selected Move:	7560	3	9	5	26600


> New Y[]: 
	
	 2  3  0  0  1  1  0  0  1  0  0  4  1  0  0  0  0  0  1  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,28

## ITERATION 204 #######################


> Neighbours evaluated; 26
> Selected Move:	7440	4	11	5	27000


> New Y[]: 
	
	 2  3  0  0  1  4  0  0  1  0  0  1  1  0  0  0  0  0  1  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,285

## ITERATION 205 #######################


> Neighbours evaluated; 23
> Selected Move:	7488	3	5	2	25500


> New Y[]: 
	
	 2  3  4  0  1  0  0  0  1  0  0  1  1  0  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0 
 > pw :0,29

## ITERATION 206 #######################


> Neighbours evaluated; 18
> Selected Move:	7415	3	4	19	25500


> New Y[]: 
	
	 2  3  4  0  0  0  0  0  1  0  0  1  1  0  0  0  0  0  1  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,295
________________________________________________________________

Best solution found: 7690
Run Termination time: 31.01.2010 12:17:25
Run duration: 00:01:07.5000000
________________________________________________________________
